Growth constants of minor-closed classes of graphs
نویسندگان
چکیده
A minor-closed class of graphs is a set of labelled graphs which is closed under isomorphism and under taking minors. For a minor-closed class G, let gn be the number of graphs in G which have n vertices. The growth constant of G is γ = lim sup(gn/n!) . We study the properties of the set Γ of growth constants of minor-closed classes of graphs. Among other results, we show that Γ does not contain any number in the interval [0, 2], besides 0, 1, ξ and 2, where ξ ≈ 1.76. An infinity of further gaps is found by determining all the possible growth constants between 2 and δ ≈ 2.25159. Our results give in fact a complete characterization of all the minor-closed classes with growth constant at most δ in terms of their excluded minors.
منابع مشابه
On the growth rate of minor-closed classes of graphs
A minor-closed class of graphs is a set of labelled graphs which is closed under isomorphism and under taking minors. For a minor-closed class G, we let gn be the number of graphs in G which have n vertices. A recent result of Norine et al. [12] shows that for all minor-closed class G, there is a constant c such that gn ≤ c nn!. Our main results show that the growth rate of gn is far from arbit...
متن کاملSome minor-closed classes of signed graphs
We define four minor-closed classes of signed graphs in terms of embeddability in the annulus, projective plane, torus, and Klein bottle. We give the full list of 20 excluded minors for the smallest class and make a conjecture about the largest class.
متن کاملThin graph classes and polynomial-time approximation schemes
Baker [1] devised a powerful technique to obtain approximation schemes for various problems restricted to planar graphs. Her technique can be directly extended to various other graph classes, among the most general ones the graphs avoiding a fixed apex graph as a minor. Further generalizations (e.g., to all proper minor closed graph classes) are known, but they use a combination of techniques a...
متن کاملRandom Graphs from a Weighted Minor-Closed Class
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a more general model. We consider random graphs from a ‘well-behaved’ class of graphs: examples of such classes include all minor-closed classes of graphs with ...
متن کاملInfinitely many minimal classes of graphs of unbounded clique-width
The celebrated theorem of Robertson and Seymour states that in the family of minor-closed graph classes, there is a unique minimal class of graphs of unbounded tree-width, namely, the class of planar graphs. In the case of tree-width, the restriction to minor-closed classes is justified by the fact that the tree-width of a graph is never smaller than the tree-width of any of its minors. This, h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 100 شماره
صفحات -
تاریخ انتشار 2010